منابع مشابه
Adaptive RBF network control for robot manipulators
TThe uncertainty estimation and compensation are challenging problems for the robust control of robot manipulators which are complex systems. This paper presents a novel decentralized model-free robust controller for electrically driven robot manipulators. As a novelty, the proposed controller employs a simple Gaussian Radial-Basis-Function Network as an uncertainty estimator. The proposed netw...
متن کاملGeneralized RBF kernel for incomplete data
We construct genRBF kernel, which generalizes the classical Gaussian RBF kernel to the case of incomplete data. We model the uncertainty contained in missing attributes making use of data distribution and associate every point with a conditional probability density function. This allows to embed incomplete data into the function space and to define a kernel between two missing data points based...
متن کاملGeneralized RBF feature maps for Efficient Detection
These kernels combine the benefits of two other important classes of kernels: the homogeneous additive kernels (e.g. the χ2 kernel) and the RBF kernels (e.g. the exponential kernel). However, large scale problems require machine learning techniques of at most linear complexity and these are usually limited to linear kernels. Recently, Maji and Berg [2] and Vedaldi and Zisserman [4] proposed exp...
متن کاملA Study of Applications of RBF Network
Forecasting is a method of making statements about certain event whose actual results have not been observed. It seems to be an easy process but is actually not. It requires a lot of analysis on current and past outcomes in order to give timely and accurate timely forecasted results.Radial Basis Function (RBF) is a method proposed in machine learning for making predictions and forecasting. It h...
متن کاملRealization of certain generalized paths in tournaments
A tournament T,, consists of a set of n vertices and a single directed edge joining every pair of distinct vertices. We denote the vertices of T’. by {l, . . . , n). A permutation aI, . . . , a, of the vertices is a generalized path. The type af the path is characterized by the sequence a,_1 = e3 l l l E~__~ where si = i-1 if e -+ ai+1 and 6 = -1 if a, -+ ai tl. We also say that mn_l is realize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of IT in Asia
سال: 2017
ISSN: 1823-5042
DOI: 10.33736/jita.400.2005